Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem

Multi-mode resource and precedence-constrained project scheduling is a well-known challenging real-world optimisation problem. An important variant of the problem requires scheduling of activities for multiple projects considering availability of local and global resources while respecting a range of constraints. This problem has been addressed by a competition, and associated set of benchmark ...

متن کامل

The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem

This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...

متن کامل

the combinatorial multi-mode resource constrained multi-project scheduling problem

this paper presents the formulation and solution of the combinatorial multi-mode resource constrained multi-project scheduling problem. the focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. the motivation for developing such an approach is due in part to practica...

متن کامل

Two Heuristic Algorithms for a Multi-Mode Resource-Constrained Multi-Project Scheduling Problem

Many studies on the resource-constrained project-scheduling problem have been published, but literature further considering multi-mode or multi-project issues often occurring in the real world is rather scarce. In this research, two heuristic algorithms are developed to solve a multi-mode resource-constrained multi-project scheduling problem (MMRCMPSP). The first, a parallel scheduling algorith...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2016

ISSN: 0020-0255

DOI: 10.1016/j.ins.2016.09.010